Reactive bisimulation semantics for a process algebra with timeouts

نویسندگان

چکیده

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results standard process algebra recursion, and complete axiomatisation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Differential Bisimulation for a Markovian Process Algebra

Formal languages with semantics based on ordinary differential equations (ODEs) have emerged as a useful tool to reason about large-scale distributed systems. We present differential bisimulation, a behavioral equivalence developed as the ODE counterpart of bisimulations for languages with probabilistic or stochastic semantics. We study it in the context of a Markovian process algebra. Similarl...

متن کامل

Process Algebra Semantics for Queues

An unbounded queue over a finite set of data 1is,,a Q. in -.A defined by an infinite system of guarded equations. The aim of this paper is to show that no finite system of guarded equations is capable of defining Q. This is a revised version of: Process algebra semantics for queues, Mathematical Centre Research Report IW241,, Amst,rdam.,1983.. * present affiliation & correspondence address: of ...

متن کامل

Process Algebra, CCS, and Bisimulation Decidability

Over the past fifteen years, there has been intensive study of formal systems that can model concurrency and communication. Two such systems are the Calculus of Communicating Systems, and the Algebra of Communicating Processes. The objective of this paper has two aspects; (1) to study the characteristics and features of these two systems, and (2) to investigate two interesting formal proofs con...

متن کامل

Bisimulation Equivanlence Is Decidable for Normed Process Algebra

We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is \elementary," having doubly exponential nondeterministic time complexity. ∗The rst author was supported in part by EPSRC Visiting Research Fellowships GR/K83243 and GR/M06468. Address for correspondence: School of Mathematical Sciences, The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel A...

متن کامل

Process Algebra and Bisimulation Techniques for Information Security

Information flow typically refers to the direct as well as implicit information resulting from the interaction of cyber processes constituting a system. Information flow also occurs in cyber-physical systems (CPSs). Information flow is difficult to detect in CPSs, due to their physical nature and complex interactions among various computational and physical components. In this work, formal meth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Informatica

سال: 2022

ISSN: ['1432-0525', '0001-5903']

DOI: https://doi.org/10.1007/s00236-022-00417-1